On the " Graph " in Particular and on Ontology in General
نویسنده
چکیده
This paper contains material presented on 31 January 2002 to staff and students of the Department of Mathematics of the University of Utrecht. The talk was one in a series of lectures titled Basic Notions in Mathematics. The paper follows closely the talk, that consisted of six parts; basic definitions, a short survey of important results, some remarks in connection with the Maximum Clique Problem, some relations with other fields in mathematics, knowledge representation and some thoughts on the usefulness of mathematics in science.
منابع مشابه
ON THE SZEGED INDEX OF NON-COMMUTATIVE GRAPH OF GENERAL LINEAR GROUP
Let $G$ be a non-abelian group and let $Z(G)$ be the center of $G$. Associate with $G$ there is agraph $Gamma_G$ as follows: Take $Gsetminus Z(G)$ as vertices of$Gamma_G$ and joint two distinct vertices $x$ and $y$ whenever$yxneq yx$. $Gamma_G$ is called the non-commuting graph of $G$. In recent years many interesting works have been done in non-commutative graph of groups. Computing the clique...
متن کاملComparison of the “Filled” Space of Iranian Painting with the “Empty” Space of The Far East Painting
Almost a particular insight is effective on the artist’s approach in creating quality of space in his painting. In fact, the general atmosphere in any painting is a reporter of artist’s thought and insight. By examining the foundational of ontology in their approach we have found some similarities and differences between the Iranian painting and the Far East painting. The purpose of this study ...
متن کاملON THE GROUPS WITH THE PARTICULAR NON-COMMUTING GRAPHS
Let $G$ be a non-abelian finite group. In this paper, we prove that $Gamma(G)$ is $K_4$-free if and only if $G cong A times P$, where $A$ is an abelian group, $P$ is a $2$-group and $G/Z(G) cong mathbb{ Z}_2 times mathbb{Z}_2$. Also, we show that $Gamma(G)$ is $K_{1,3}$-free if and only if $G cong {mathbb{S}}_3,~D_8$ or $Q_8$.
متن کاملCentralized Clustering Method To Increase Accuracy In Ontology Matching Systems
Ontology is the main infrastructure of the Semantic Web which provides facilities for integration, searching and sharing of information on the web. Development of ontologies as the basis of semantic web and their heterogeneities have led to the existence of ontology matching. By emerging large-scale ontologies in real domain, the ontology matching systems faced with some problem like memory con...
متن کاملPrioritize the ordering of URL queue in Focused crawler
The enormous growth of the World Wide Web in recent years has made it necessary to perform resource discovery efficiently. For a crawler it is not an simple task to download the domain specific web pages. This unfocused approach often shows undesired results. Therefore, several new ideas have been proposed, among them a key technique is focused crawling which is able to crawl particular topical...
متن کاملخوشهبندی اسناد مبتنی بر آنتولوژی و رویکرد فازی
Data mining, also known as knowledge discovery in database, is the process to discover unknown knowledge from a large amount of data. Text mining is to apply data mining techniques to extract knowledge from unstructured text. Text clustering is one of important techniques of text mining, which is the unsupervised classification of similar documents into different groups. The most important step...
متن کامل